An Eecient Mean Field Annealing Formulation for Mapping Unstructured Domains to Hypercubes ?
نویسنده
چکیده
We propose an eecient MFA formulation for mapping un-structured domains to hypercube-connected distributed-memory archi-tectures. In the general MFA formulation, NP spin variables are maintained and an individual MFA iteration requires (davgP +P 2) time for the mapping of a sparse domain graph with N vertices and average vertex degree of davg to a parallel architecture with P processors. The proposed hypercube-speciic MFA formulation asymptotically reduces the number of spin variables and the computational complexity of an individual MFA iteration to Nlg2P and (davglg2P +Plg2P), respectively, by exploiting the topological properties of hypercubes.
منابع مشابه
An Efficient Mean Field Annealing Formulation for Mapping Unstructured Domains to Hypercubes
We propose an e cient MFA formulation for mapping un structured domains to hypercube connected distributed memory archi tectures In the general MFA formulation N P spin variables are main tained and an individual MFA iteration requires davgP P time for the mapping of a sparse domain graph withN vertices and average vertex degree of davg to a parallel architecture with P processors The proposed ...
متن کاملA New Mappingheuristic Based Onmean Field Annealing 1
A new mapping heuristic is developed, based on the recently proposed Mean Field Annealing (MFA) algorithm. An eecient implementation scheme, which decreases the complexity of the proposed algorithm by asymptotical factors, is also given. Performance of the proposed MFA algorithm is evaluated in comparison with two well-known heuristics; Simulated Annealing and Kernighan-Lin. Results of the expe...
متن کاملAn Efficient Mapping Heuristic for Mesh-Connected Parallel Architectures Based on Mean Field Annealing
A new Mean Field Annealing MFA formulation is proposed for the mapping problem for mesh connected architectures The proposed MFA heuristic exploits the conventional routing scheme used in mesh in terconnection topologies to introduce an e cient encoding scheme An e cient implementation scheme which decreases the complexity of the proposed algorithm by asymptotical factors is also developed Expe...
متن کاملA New Mapping Heuristic Based on Mean Field Annealing
A new mapping heuristic is developed based on the recently proposed Mean Field Annealing MFA algorithm An e cient implementation scheme which decreases the complexity of the proposed algorithm by asymptotical factors is also given Per formance of the proposed MFA algorithm is evaluated in comparison with two well known heuristics Simulated Annealing and Kernighan Lin Results of the exper iments...
متن کاملFlow Field Characteristics of an Aerospike Nozzle Using Different Turbulence Models
To improve the calculation of the flow properties of an aerospike nozzle, different turbulence models were investigated in this study. The primary shape of the nozzle plug is determined through utilizing an approximate method. The flow field is, then, simulated using the Navier-Stokes equations for compressible flows. The commercial computational fluid dynamics code Fluent is used to simulate t...
متن کامل